Constructive Duality in Integer Programming
نویسندگان
چکیده
منابع مشابه
Integer Programming Duality
This article describes what is known about duality for integer programs. It is perhaps surprising that many of the results familiar from linear programming (LP) duality do extend to integer programming. However, this generalization requires adoption of a more general point of view on duality than is apparent from studying the linear programming case. Duality theory, as we shall define it here, ...
متن کاملInteger Programming Duality in Multiple Objective Programming
The weighted sums approach for linear and convex multiple criteria optimization is well studied. The weights determine a linear function of the criteria approximating a decision makers overall utility. Any efficient solution may be found in this way. This is not the case for multiple criteria integer programming. However, in this case one may apply the more general e-constraint approach, result...
متن کاملConstructive vs Perturbative Local Search for General Integer Linear Programming⋆
Most local search algorithms are “perturbative”, incrementally moving from a search state to a neighbouring state while performing noisy hill-climbing. An alternative form of local search is “constructive”, repeatedly building partial solutions using greedy or other heuristics. Both forms have been combined with constraint propagation, and they can be hybridised with each other by perturbing pa...
متن کاملExact augmented Lagrangian duality for mixed integer linear programming
We investigate the augmented Lagrangian dual (ALD) for mixed integer linear programming (MIP) problems. ALD modifies the classical Lagrangian dual by appending a nonlinear penalty function on the violation of the dualized constraints in order to reduce the duality gap. We first provide a primal characterization for ALD for MIPs and prove that ALD is able to asymptotically achieve zero duality g...
متن کاملSecond order symmetric duality for nonlinear multiobjective mixed integer programming
9 Abstract 10 We formulate two pairs of second order symmetric duality for nonlinear multiobjective mixed integer programs for 11 arbitrary cones. By using the concept of efficiency and second order invexity, we establish the weak, strong, converse 12 and self-duality theorems for our dual models. Several known results are obtained as special cases. 17 Following the earlier works of Dorn [5], D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Applied Mathematics
سال: 1974
ISSN: 0036-1399,1095-712X
DOI: 10.1137/0127003